Purcell's method, Egerváry and related results
نویسنده
چکیده
After having been appeared, Egerváry was perhaps the first who responded to Purcell’s paper in 1957. Later in a posthumous paper he returned to the method in 1960, showing that it could be derived from his rank reduction procedure. We review here Purcell’s method in connection with Egerváry’s activity and also, we give a short survey on subsequent developments.
منابع مشابه
Some good characterization results relating to the Kőnig-Egerváry theorem
We survey some combinatorial results which are all related to some former results of ours, and, at the same time, they are all related to the famous Kőnig–Egerváry theorem from 1931.
متن کاملJenő Egerváry: from the origins of the Hungarian algorithm to satellite communication
We discuss some relevant results obtained by Egerváry in the early Thirties, whose importance has been recognized several years later. We start with a quite well-known historical fact: the first modern polynomial-time algorithm for the assignment problem, invented by Harold W. Kuhn half a century ago, was christened the “Hungarianmethod” to highlight that it derives from two older results, byKő...
متن کاملSpecification, testing, and interpretation of gene-by-measured-environment interaction models in the presence of gene-environment correlation.
Purcell (Twin Res 5:554-571, 2002) proposed a bivariate biometric model for testing and quantifying the interaction between latent genetic influences and measured environments in the presence of gene-environment correlation. Purcell's model extends the Cholesky model to include gene-environment interaction. We examine a number of closely related alternative models that do not involve gene-envir...
متن کاملThe rank reduction procedure of Egerváry
Here we give a survey of results concerning the rank reduction algorithm developed by Egerváry between 1953 and 1958 in a sequence of papers.
متن کاملA Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings
The independence number of a graph G, denoted by α(G), is the cardinality of an independent set of maximum size in G, while μ(G) is the size of a maximum matching in G, i.e., its matching number. G is a König–Egerváry graph if its order equals α(G)+μ(G). In this paper we give a new characterization of König–Egerváry graphs. We also deduce some properties of vertices belonging to all maximum ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CEJOR
دوره 18 شماره
صفحات -
تاریخ انتشار 2010